Random Partitions with Parts in the Range of a Polynomial
نویسندگان
چکیده
Let Ω(n,Q) be the set of partitions of n into summands that are elements of the set A = { Q(k) : k ∈ Z } . Here Q ∈ Z[x] is a fixed polynomial of degree d > 1 which is increasing on R, and such that Q(m) is a non– negative integer for every integer m ≥ 0. For every λ ∈ Ω(n,Q), letMn(λ) be the number of parts, with multiplicity, that λ has. Put a uniform probability distribution on Ω(n,Q), and regard Mn as a random variable. The limiting density of the random variable Mn (suitably normalized) is determined explicitly. For specific choices of Q, the limiting density has appeared before in rather different contexts such as Kingman’s coalescent, and processes associated with the maxima of Brownian bridge and Brownian meander processes.
منابع مشابه
Stirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کاملRandom Walks on Strict Partitions
We consider a certain sequence of random walks. The state space of the nth random walk is the set of all strict partitions of n (that is, partitions without equal parts). We prove that, as n goes to infinity, these random walks converge to a continuous-time Markov process. The state space of this process is the infinite-dimensional simplex consisting of all nonincreasing infinite sequences of n...
متن کاملExploring the Use of Random Regression Models withLegendre Polynomials to Analyze Clutch Sizein Iranian Native Fowl
Random regression models (RRM) have become common for the analysis of longitudinal data or repeated records on individual over time. The goal of this paper was to explore the use of random regression models with orthogonal / Legendre polynomials (RRL) to analyze new repeated measures called clutch size (CS) as a meristic trait for Iranian native fowl. Legendre polynomial functions of increasing...
متن کاملHosoya polynomials of random benzenoid chains
Let $G$ be a molecular graph with vertex set $V(G)$, $d_G(u, v)$ the topological distance between vertices $u$ and $v$ in $G$. The Hosoya polynomial $H(G, x)$ of $G$ is a polynomial $sumlimits_{{u, v}subseteq V(G)}x^{d_G(u, v)}$ in variable $x$. In this paper, we obtain an explicit analytical expression for the expected value of the Hosoya polynomial of a random benzenoid chain with $n$ hexagon...
متن کاملRandom partitions with restricted part sizes
For a subsetS of positive integers let (n,S)be the set of partitions ofn into summands that are elements of S. For every λ ∈ (n,S), let Mn(λ) be the number of parts, with multiplicity, that λ has. Put a uniform probability distribution on (n,S), and regardMn as a random variable. In this paper the limiting density of the (suitably normalized) random variableMn is determined for sets that are su...
متن کامل